Blockwise Repeated Low - Density Burst Error Correcting Linear Codes
نویسندگان
چکیده
The paper presents necessary and sufficient condition on the number of parity-check digits required for the existence of a linear code capable of correcting errors in the form of 2-repeated low-density bursts occurring within a sub-block. An illustration of a code of length 24 correcting all 2-repeated low-density bursts of length 3 or less with weight 2 or less occurring within a sub-block of length 12 has also been provided.
منابع مشابه
Codes Correcting Repeated Burst Errors Blockwise
This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65
متن کاملBlockwise Solid Burst Error Correcting Codes
This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.
متن کاملOn 2-Repeated Burst Codes
There are several kinds of burst errors for which error detecting and error correcting codes have been constructed. In this paper, we consider a new kind of burst error which will be termed as ‘2-repeated burst error of length b(fixed)’. Linear codes capable of detecting such errors have been studied. Further, codes capable of detecting and simultaneously correcting such errors have also been d...
متن کاملREPEATED LOW - DENSITY BURST ERROR LOCATING CODES B . K . Dass and Surbhi Madan
This paper deals with derivation of bounds for linear codes which are able to detect and locate 2-repeated low-density burst errors occurring within a sub-block. An example of such a code has also been provided. 2000 Mathematics Subject Classification: 94B20, 94B65, 94B25.
متن کاملRepeated Burst Error Detecting Linear Codes
This paper presents lower bounds on the number of paritycheck digits required for a linear code that is capable of detecting errors which are ‘m-repeated burst errors’. Further, codes capable of detecting and simultaneously correcting such errors have also been studied. ∗Corresponding author. Ratio Mathematica, 19, pp. 25-30
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013